On dual toric complete intersection codes
نویسندگان
چکیده
منابع مشابه
On dual toric complete intersection codes
In this paper we study duality for evaluation codes on intersections of d hypersurfaces with given d -dimensional Newton polytopes, so called toric complete intersection codes. In particular, we give a condition for such a code to be quasi-self-dual. In the case of d = 2 it reduces to a combinatorial condition on the Newton polygons. This allows us to give an explicit construction of dual and q...
متن کاملToric complete intersection codes
In this paper we construct evaluation codes on zero-dimensional complete intersections in toric varieties and give lower bounds for their minimum distance. This generalizes the results of Gold–Little–Schenck and Ballico–Fontanari who considered evaluation codes on complete intersections in the projective space.
متن کاملRing graphs and complete intersection toric ideals
We study the family of graphs whose number of primitive cycles equals its cycle rank. It is shown that this family is precisely the family of ring graphs. Then we study the complete intersection property of toric ideals of bipartite graphs and oriented graphs. An interesting application is that complete intersection toric ideals of bipartite graphs correspond to ring graphs and that these ideal...
متن کاملOn the Geometry of Complete Intersection Toric Varieties
In this paper we give a geometric characterization of the cones of toric varieties that are complete intersections. In particular, we prove that the class of complete intersection cones is the smallest class of cones which is closed under direct sum and contains all simplex cones. Further, we show that the number of the extreme rays of such a cone, which is less than or equal to 2n − 2, is exac...
متن کاملOn m-dimensional toric codes
Toric codes are a class of m-dimensional cyclic codes introduced recently by J. Hansen in [7], [8], and studied in [9], [5], [10]. They may be defined as evaluation codes obtained from monomials corresponding to integer lattice points in an integral convex polytope P ⊆ Rm. As such, they are in a sense a natural extension of Reed-Solomon codes. Several articles cited above use intersection theor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2015
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2014.12.001